Maximum Homologous Crossover for Linear Genetic Programming
نویسندگان
چکیده
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar structures from parents, by aligning them according to their homology, thanks to an algorithm used in Bio-Informatics. To highlight disruptive effects of crossover operators, we introduce the Royal Road landscapes and the Homology Driven Fitness problem, for Linear Genetic Programming. Two variants of the new crossover operator are described and tested on this landscapes. Results show a reduction in the bloat phenomenon and in the frequency of deleterious crossovers.
منابع مشابه
Homologous Crossover in Genetic Programming
In recent years, the genetic programming crossover operator has been criticized on both theoretical and empirical grounds. This paper introduces a new crossover operator for linear genomes that encourages the emergence of positional homology in the population. Preliminary experimental results suggest that this approach is a promising direction for redesign of the mechanism of crossover.
متن کاملOn the Search Biases of Homologous Crossover in Linear Genetic Programming and Variable-length Genetic Algorithms
With a schema-theoretic approach and experiments we study the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations where the population pres...
متن کاملOn The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms
In this paper we study with a schema-theoretic approach and experiments the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are totally unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations whe...
متن کاملExact Schema Theory for GP and Variable-length GAs with Homologous Crossover
In this paper we present a new exact schema theory for genetic programming and variable-length genetic algorithms which is applicable to the general class of homologous crossovers. These are a group of operators, including GP one-point crossover and GP uniform crossover, where the offspring are created preserving the position of the genetic material taken from the parents. The theory is based o...
متن کاملSize Fair and Homologous Tree Genetic Programming Crossovers
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With...
متن کامل